Term rewriting with built-in numbers and collection data structures
نویسنده
چکیده
OF DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Computer Science The University of New Mexico Albuquerque, New Mexico
منابع مشابه
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it can be used to model lazy evaluation in functional languages such as Haskell. Building upon previous work on constrained equational rewrite systems (CERSs), an expressive and elegant class of rewrite systems that contain...
متن کاملDependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
Rewrite systems on free data structures have limited expressive power since semantic data structures like sets or multisets cannot be modeled elegantly. In this work we define a class of rewrite systems that allows the use of semantic data structures. Additionally, built-in natural numbers, including (dis)equality, ordering, and divisibility constraints, are supported. The rewrite mechanism is ...
متن کاملOperational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
While ordinary conditional rewrite systems are more elegant than unconditional ones, they still have limited expressive power since semantic data structures, such as sets or multisets, cannot be modeled elegantly. Extending our work presented at RTA 2008 [9], the present paper defines a class of conditional rewrite systems that allows the use of semantic data structures and supports built-in na...
متن کاملRewriting on cyclic structures ?
We present a categorical formulation of the rewriting of possibly cyclic term graphs, and the proof that this presentation is equivalent to the well-accepted operational deenition proposed in 3]|but for the case of circular redexes, for which we propose (and justify formally) a diierent treatment. The categorical framework, based on suitable 2-categories, allows to model also automatic garbage ...
متن کاملPreserving Confluence for Rewrite Systems with Built-in Operations
We consider combinations of term rewriting with built-in operations which compute objects of some external domain from ground terms. Combining a canonical term rewriting system with a computation relation does in general not lead to a canonical simpliication relation. We show how a canonical simpliication system can be constructed for such rewrite systems with built-in operations. Decomposition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009